Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.Comment: Extended version of a submittion accepted at RP'14 Worksho

Model Checking Linear Logic Specifications

The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems. Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs. Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.Comment: 53 pages, 12 figures "Under consideration for publication in Theory and Practice of Logic Programming

Parameterized verification of publish/subcribe protocols via Infinite-State Model Checking

We apply the Infinite-State Model Checking to formally specify and validate protocol skeletons for distributed systems with asynchronous communication and synchronous access to local data structures. More precisely, we validate the Redis Pub/Sub key-value Server. Redis is based on a publish-subscribe architecture used in Cloud Storage and Internet of Things ecosystems. For the considered protocol, we present a formal specification that combines ideas coming from round-based and shared-memory specification languages. The resulting model is validated via the SMT-based Infinite-state Model Checker Cubicle. In this setting we use unbounded arrays to model (1) arbitrary collections of publishers and subscribers, (2) unbounded shared memory used as a communication media between processes. Our model is validated using the symbolic backward reachability algorithm implemented in the tool. The peculiarity of the algorithm is that, upon termination, the resulting correctness proof is guaranteed to hold for every number of process instances

Model checking infinite-state systems in CLP

The verification of safety and liveness properties for infinite-state systems is an important research problem. Can the well-established concepts and the existing technology for programming over constraints as first-class data structures contribute to this research? The work reported in this paper is a starting point for the experimental evaluation of constraint logic programming as a conceptual basis and practical implementation platform for model checking. We have implemented an automated verification method in CLP using real and boolean constraints. We have used the method on a number of infinite-state systems that model concurrent programs using integers or buffers. The basis of the correctness of our implementation is a formal connection between CLP programs and the formalism used for specifying concurrent systems

Signatures of Secondary Collisionless Magnetic Reconnection Driven by Kink Instability of a Flux Rope

The kinetic features of secondary magnetic reconnection in a single flux rope undergoing internal kink instability are studied by means of three-dimensional Particle-in-Cell simulations. Several signatures of secondary magnetic reconnection are identified in the plane perpendicular to the flux rope: a quadrupolar electron and ion density structure and a bipolar Hall magnetic field develop in proximity of the reconnection region. The most intense electric fields form perpendicularly to the local magnetic field, and a reconnection electric field is identified in the plane perpendicular to the flux rope. An electron current develops along the reconnection line in the opposite direction of the electron current supporting the flux rope magnetic field structure. Along the reconnection line, several bipolar structures of the electric field parallel to the magnetic field occur making the magnetic reconnection region turbulent. The reported signatures of secondary magnetic reconnection can help to localize magnetic reconnection events in space, astrophysical and fusion plasmas

Approaching the Coverability Problem Continuously

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstrate the effectiveness of our approach on standard benchmarks from the literature, which shows that our approach decides significantly more instances than any existing tool and is in addition often much faster, in particular on large instances.Comment: 18 pages, 4 figure

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.Comment: In Proceedings PACO 2011, arXiv:1108.145

Attractive Potential around a Thermionically Emitting Microparticle

We present a simulation study of the charging of a dust grain immersed in a plasma, considering the effect of electron emission from the grain (thermionic effect). It is shown that the OML theory is no longer reliable when electron emission becomes large: screening can no longer be treated within the Debye-Huckel approach and an attractive potential well forms, leading to the possibility of attractive forces on other grains with the same polarity. We suggest to perform laboratory experiments where emitting dust grains could be used to create non-conventional dust crystals or macro-molecules.Comment: 3 figures. To appear on Physical Review Letter

Future beam experiments in the magnetosphere with plasma contactors: The electron collection and ion emission routes

Experiments where a high‐voltage electron beam emitted by a spacecraft in the low‐density magnetosphere is used to probe the magnetospheric configuration could greatly enhance our understanding of the near‐Earth environment. Their challenge, however, resides in the fact that the background magnetospheric plasma cannot provide a return current that balances the electron beam current without charging the spacecraft to such high potential that in practice prevents beam emission. In order to overcome this problem, a possible solution is based on the emission of a high‐density contactor plasma by the spacecraft prior to and after the beam. We perform particle‐in‐cell simulations to investigate the conditions under which a high‐voltage electron beam can be emitted from a magnetospheric spacecraft, comparing two possible routes that rely on the high‐density contactor plasma. The first is an “electron collection” route, where the contactor has lower current than the electron beam and is used with the goal of connecting to the background plasma and collecting magnetospheric electrons over a much larger area than that allowed by the spacecraft alone. The second is an “ion emission” route, where the contactor has higher current than the electron beam. Ion emission is then enabled over the large quasi‐spherical area of the contactor cloud, thus overcoming the space charge limits typical of ion beam emission. Our results indicate that the ion emission route offers a pathway for performing beam experiments in the low‐density magnetosphere, while the electron collection route is not viable because the contactor fails to draw a large neutralizing current from the background.Key PointsThe ion emission route is credible for beam experiments in the magnetosphereThe electron collection route is not viableThe background plasma facilitates beam emissionPeer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/111985/1/jgra51700.pd